DCV route control in baggage handling systems using a hierarchical control architecture and mixed integer linear programming ∗

Modern baggage handling systems transport the baggage at high speeds, on a network of tracks, using destination coded vehicles (DCV). In order to ensure the optimal routing of DCVs, in this paper we propose a hierarchical control framework. In this framework switch controllers provide position instructions for each switch in the network. The switch controllers are then supervised by a so-called network controller that mainly takes care of flows of DCVs. The routing control problem for the network controller is a nonlinear, mixed integer optimization problem, with high computational requirements, which makes it intractable in practice. Therefore, we present an alternative approach for reducing the complexity of the computations by approximating the nonlinear optimization problem and rewriting it as a mixed integer linear programming (MILP) problem. The advantage is that for MILP problems solvers are available that allow us to efficiently compute the global optimal solution. The solution of the MILP problem is then used for computing optimal switch control actions. For a benchmark case study we compare the hierarchical route control with switch control approaches that have been developed previously. Results indicate that the proposed hierarchical control offers a balanced trade-off between optimality and computational efficiency.